基于静止图象的数字水印算法研究

随着因特网和多媒体技术的不断发展,数字媒体已成为人们获取知识的主要手段,但也带来一系列的问题:如作品侵权、非法复制和传播等。而数字水印技术作为版权保护的重要手段,已得到广泛的应用和研究。概述了数字水印技术,并提出了一种新的基于静止图象的数字水印算法。该算法的密钥由原始图象、水印图象和随机数发生器的种子共同决定。而且,该算法能承受有损压缩、旋转、剪切等几种攻击,经实验证明具有良好的鲁棒性。     

先验式秘密共享方案及实现

分析了传统的秘密共享算法的不足之处,提出了相应的优化方案,形成了先验式秘密共享方案,包括初始化、份额更新、份额恢复和秘密重构,实现了先验式秘密共享协议的各种算法,充分考虑了秘密分享的各个阶段可能遇到的问题,并分别给出了相应的解决方案.     

Revenue sharing contracts in a supply chain with uncontractible actions

We consider a supplier–customer relationship where the customer faces a typical Newsvendor problem of determining perishable capacity to meet uncertain demand. The customer outsources a critical, demand‐enhancing service to an outside supplier, who receives a fixed share of the revenue from the customer. Given such a linear sharing contract, the customer chooses capacity and the service supplier chooses service effort level before demand is realized. We consider the two cases when these decisions are made simultaneously (simultaneous game) or sequentially (sequential game). For each game, we analyze how the equilibrium solutions vary with the parameters of the problem. We show that in the equilibrium, it is possible that either the customer's capacity increases or the service supplier's effort level decreases when the supplier receives a larger share of the revenue. We also show that given the same sharing contract, the sequential game always induces a higher capacity and more effort. For the case of additive effort effect and uniform demand distribution, we consider the customer's problem of designing the optimal contract with or without a fixed payment in the contract, and obtain sensitivity results on how the optimal contract depends on the problem parameters. For the case of fixed payment, it is optimal to allocate more revenue to the supplier to induce more service effort when the profit margin is higher, the cost of effort is lower, effort is more effective in stimulating demand, the variability of demand is smaller or the supplier makes the first move in the sequential game. For the case of no fixed payment, however, it is optimal to allocate more revenue to the supplier when the variability of demand is larger or its mean is smaller. Numerical examples are analyzed to validate the sensitivity results for the case of normal demand distribution and to provide more managerial insights. © 2008 Wiley Periodicals, Inc. Naval Research Logistics, 2008     

一种改进的量子粒子群算法

量子粒子群算法是将量子计算与粒子群算法相结合的一种新的优化方法。首先利用相位角进行实数编码，将动态量子旋转门引入到粒子群算法中，采用自适应变异，提出了一种改进的量子粒子群算法。然后运用Pe-nalized函数和Ackley函数测试了该算法的性能。最后将该算法应用到武器目标分配模型中，获得了最优的分配方案。仿真研究表明，该算法具有收敛速度快、搜索能力强和稳定性高的特点。     

Stability of information‐sharing alliances in a three‐level supply chain

In their recent article, Leng and Parlar (L&P) (2009) analyze information‐sharing alliances in a three‐level supply chain (consisting of a manufacturer, a distributor, and a retailer) that faces a nonstationary end demand. Supply chain members can share demand information, which reduces information distortion and thus decreases their inventory holding and shortage costs. We expand the results from L&P by considering dynamic (farsighted) stability concepts. We use two different allocation rules and show that under some reasonable assumptions there should always be some information sharing in this supply chain. We also identify conditions under which the retailer in a stable outcome shares his demand information with the distributor, with the manufacturer, or with both remaining supply chain members. © 2010 Wiley Periodicals, Inc. Naval Research Logistics, 2010     

基于区块链的地学大数据管理

随着地理观测技术、计算机网络和地理信息系统、社会调查统计的迅速发展,具有空间位置的自然环境数据正在急剧增长,上升到大数据级别。而传统的数据库已经无法满足现有地学大数据的规模和增长速度。在资源访问方面,人们更加担心数据安全与隐私保护问题。由于数据交易的双方和交易中介都是互不信任的,这显然不利于数据的共享与流通,将阻碍地学大数据产业的发展。常用地学数据管理系统主要由单一机构进行维护管理,在多方用户参与的情形下,由于无法信任数据库中的数据,每一方用户都需要一个专用数据库,这样不同数据库之间数据的差异将产生繁琐的争议。区块链的到来却给这一问题的解决带来了希望,区块链技术实现了不完全可信网络环境中的可信数据管理,具有去中心化、防篡改、不可抵赖、完整性等特性,从而为解决目前依靠中心或第三方机构存在的高成本低效率和信息安全问题提供了切实的方法。本文从区块链的共识机制、智能合约、身份验证、数据溯源等方面进行阐述,并重点分析区块链如何解决流通和共享数据的问题,让地学大数据真正得以广泛应用。     

联邦滤波器在INS/GPS/DVS组合导航系统中的新应用

针对某机载导航系统不能满足高精度导航定位需要的问题,采用了动态信息分配系数方法,提出了一种新的基于联邦滤波器的INS/GPS/DVS组合导航方案,通过对各子滤波器的信息分配系数进行优化,增强了组合系统的导航性能.仿真结果表明,该方案充分提取了导航传感器的信息,有效地提高了组合导航系统的精度和故障检测能力.     

信息发现元数据标准草案设计与研究

文中给出了标准元数据标准的整体框架,进行了信息元数据标准草案的设计,确定了发现元数据标准草案中核心元素,并采用UML对元数据元素进行了定义,对核心元素和修饰词的关系进行了描述。以RDF为描述语言实现了信息发现元数据的形式化描述。信息发现元数据的建设,将为数据工程建设提供基础支撑,为信息共享提供了新的途径。     

混沌Lurie系统同步在保密通信中的应用

鉴于Lurie系统在工程中的普遍性,研究了混沌Lurie系统同步在保密通信中的应用.以Lyapunov稳定性理论为基础,通过求解一个Riccati方程,给出同步控制律,并将其应用于通过混沌掩盖实现保密通信的驱动一响应系统.仿真表明,即使传输幅度较大的信息信号,混沌Lurie系统也能对其实现较好的掩盖,驱动一响应系统能够迅速同步,并且同步过程没有超调或振荡.     

基于极化单光子和量子计算的量子秘密共享

结合量子计算算子提出一种基于极化单光子的量子秘密共享协议.该方案可以将全部量子态用于密钥共享,借助量子置换算子和量子纠缠特性证明了方案能够有效抵抗中间人攻击,利用辅助量子态进行监视,方案能够以高概率检测特洛伊木马攻击.通过对置换算子进行高维推广,证明了方案推广到(n,n)的可行性和实用性.